A simple livelock-free algorithm for packet switching
نویسندگان
چکیده
منابع مشابه
Deadlock- and Livelock-Free Routing Protocols for Wave Switching
Wave switching is a hybrid switching technique for high performance routers. It combines wormhole switching and circuit switching in the same router architecture. Wave switching achieves very high performance by exploiting communication locality. When two nodes are going to communicate frequently, a physical circuit is established between them. By combining circuit switching, pre-established ph...
متن کاملAn adaptive deadlock and livelock free routing algorithm
This paper is concerned with Store and Forward deadlocks (DL) arising in interprocessor network systems with buffered packet switched communications. Algorithms which implement DL free routing use adaptive or not adaptive routing modality. Not adaptive algorithms underuse the interconnection network bandwidth because they impose restrictions to the routing paths; adaptive algorithms are DL free...
متن کاملImproved Antnet Routing Algorithm for Packet Switching
Antnet is a software agent based routing algorithm that is influenced by the unsophisticated and individual ant’s emergent behaviour. In this paper a modified antnet algorithm for packet switched network has been proposed that offer improvement in the throughput and the average delay by means of detecting and dropping packets routed through the non-optimal routes. By applying boundaries to the ...
متن کاملLivelock free routing schemes
We give a livelock free routing algorithm for any allowed network. Unlike some other solutions to this problem: 1) packets entering the network have an absolute upper bound on the time to reach their destination; 2) under light loads, packets are delivered to their destinations in nearly optimal time; 3) packets with desired paths far away from congested areas will have routing times far shorte...
متن کاملGenetic Algorithm for Shortest Path in Packet Switching Networks
The problem of finding the shortest path between two nodes is a well known problem in network analysis. Optimal routing has been widely studied for interconnection networks this paper considers the problem of finding the shortest path. A Genetic algorithm based strategy is proposed and the algorithm has been developed to find the shortest (Optimal) Path Variable-length chromosomes (strings) and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1984
ISSN: 0167-6423
DOI: 10.1016/0167-6423(84)90002-9